Learning chromatin states with factorized information criteria
نویسندگان
چکیده
منابع مشابه
Learning from Examples with Information Theoretic Criteria
This paper discusses a framework for learning based on information theoretic criteria. A novel algorithm based on Renyi’s quadratic entropy is used to train, directly from a data set, linear or nonlinear mappers for entropy maximization or minimization. We provide an intriguing analogy between the computation and an information potential measuring the interactions among the data samples. We als...
متن کاملIn-Database Factorized Learning
In this paper, we overview recent contributions on in-database analytics for a class of optimization problems that are important for LogicBlox retail-planning and forecasting applications [4, 5, 7]. The class includes ridge linear regression, polynomial regression, factorization machines, principal component analysis and classification models. Such problems are typically computed over input dat...
متن کاملMass condensation in one dimension with pair-factorized steady states
We consider stochastic rules of mass transport which lead to steady states that factorize over the links of a one-dimensional ring. Based on the knowledge of the steady states, we derive the onset of a phase transition from a liquid to a condensed phase that is characterized by the existence of a condensate. For various types of weight functions which enter the hopping rates, we determine the s...
متن کاملMass condensation in one dimension with pair - factorized steady states
We consider stochastic rules of mass transport which lead to steady states that factorize over the links of a one-dimensional ring. Based on the knowledge of the steady states, we derive the onset of a phase transition from a liquid to a condensed phase that is characterized by the existence of a condensate. For various types of weight functions which enter the hopping rates, we determine the s...
متن کاملPair-factorized steady states on arbitrary graphs
Stochastic mass transport models are usually described by specifying hopping rates of particles between sites of a given lattice, and the goal is to predict the existence and properties of the steady state. Here we ask the reverse question: given a stationary state that factorizes over links (pairs of sites) of an arbitrary connected graph, what are possible hopping rates that converge to this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2015
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btv163